#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
}
int main()
{
    ll T = 1;
    cin >> T;
    while (T--)
    {
        // ll n;
        // cin >> n;
        // vector<ll> a(n + 1);
        // set<ll> s;
        // for (ll i = 1; i <= n; i++)
        //     cin >> a[i];
        cout << (1 ^ 0) << endl;

        1-1
        3-11
        5-111
        7-1111
        9-11111
    }
    return 0;
}